有限域上的重根自对偶负循环码

Let F_q be a finite field with q = p~m, where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2~ap~r over F_q, a ≥ 1.The construction of self-dual negacyclic codes of length 2~abp~r over F_q is also provided, where gcd(2, b) = gcd(b, p) = 1 and a ≥ 1.     

关于Goppa 几何码最小距离的一个新方法

引进一个关于Goppa几何码(代数几何码)最小距离界的一个新方法.应用Maharaj的思想(即用显示基来近似表达Riemann-Roch空间)到Goppa几何码的最小距离的界上去.通过厄米特曲线上的代数几何码的一类例子,来证明标准的几何码的下界在某些情形下可以被显著地改进.进一步地,我们给出了这些码的最小距离上界,并说明了我们的下界非常接近这个上界.     

Alkane isomers: presence in petroleum ether and complexity

The presence and absence of alkane isomers in petroleum and petroleum derivatives depend on the complexity of these structures. It was assumed that the more complex the structure is the less probable it is that that the molecule can be detected in any petroleum derivative. Complexity is a vague concept, which has not been defined in quantitative terms yet, and therefore there is no experimental method, which could be used to determine ‘complexity’. Mass spectrometry and infrared spectroscopy in combination with gas chromatography were used to identify the various structural isomers of alkanes in petroleum ether. The isomers were categorised in quantitative terms by using topological indices and linear discriminant analysis. It was found that alkanes possessing a more complex, highly branched structure are less probable to be detected in petroleum ether than isomers with a simpler backbone structure. It was proposed that the experimental ‘measure’ of the complexity of isomer_i should be proportional to 1/C_i , where C_i , denotes the concentration of isomer_i in a (primary) petroleum derivative.     

Performance analysis and design of quasi-cyclic LDPC codes for underwater magnetic induction communications

Magnetic induction (MI) communication is an effective scheme for underwater wireless communication. In this paper, we aim to design an underwater MI communication system based on Quasi-cyclic LDPC (QC-LDPC) codes. Firstly, for a given QC-LDPC code used in underwater MI communication, we propose a novel algorithm to evaluate its performance, which is named as underwater magnetic induction protograph (UWMIP) extrinsic information transfer algorithm. Furthermore, we present a differential evolution UWMIP (DE-UWMIP) algorithm, which incorporates the differential evolution method and the UWMIP algorithm. By this algorithm, we search the optimized QC-LDPC codes with best distance threshold. Simulation results show that the proposed algorithm is effective and provide a good guidance to design the underwater MI communication system.     

Multiple decoding for polar-coded chase combining HARQ

The polar-coded hybrid automatic repeat request (HARQ) scheme with chase combining (CC) has very low complexity and is easy to combine with other techniques such as the coded-modulation and space–time coding, etc. However, the CC-HARQ scheme usually suffers from error and throughput performance degradation. A multiple decoding CC-HARQ (MDCC-HARQ) scheme is proposed in this paper by providing extra decoding chances when the joint decoding fails. Specifically, new LLR-sequences are constructed from the received signals, which can be utilized for the extra decoding attempts. Simulation results show that the proposed MDCC-HARQ scheme can achieve better error-performance and higher throughput efficiency, while requires less retransmission when compared with the CC-HARQ scheme.     

Secure Polar Coding for the Primitive Relay Wiretap Channel

With the emergence of wireless networks, cooperation for secrecy is recognized as an attractive way to establish secure communications. Departing from cryptographic techniques, secrecy can be provided by exploiting the wireless channel characteristics; that is, some error-correcting codes besides reliability have been shown to achieve information-theoretic security. In this paper, we propose a polar-coding-based technique for the primitive relay wiretap channel and show that this technique is suitable to provide information-theoretic security. Specifically, we integrate at the relay an additional functionality, which allows it to smartly decide whether it will cooperate or not based on the decoding detector result. In the case of cooperation, the relay operates in a decode-and-forward mode and assists the communication by transmitting a complementary message to the destination in order to correctly decode the initial source’s message. Otherwise, the communication is completed with direct transmission from source to the destination. Finally, we first prove that the proposed encoding scheme achieves weak secrecy, then, in order to overcome the obstacle of misaligned bits, we implement a double-chaining construction, which achieves strong secrecy.     

Covering and radius-covering arrays: Constructions and classification

The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays, explicit constructions from covering codes are developed. Lower bounds are improved upon using connections to orthogonal arrays, partition matrices, and covering codes, and in specific cases by computation. Consequently for some parameter sets the minimum size of a covering array is determined precisely. For some of these, a complete classification of all inequivalent covering arrays is determined, again using computational techniques. Existence tables for up to 10 columns, up to 8 symbols, and all possible strengths are presented to report the best current lower and upper bounds, and classifications of inequivalent arrays.